Testing the Scalability of Overlay Routing Infrastructures

نویسندگان

  • Sushant Rewaskar
  • Jasleen Kaur
چکیده

Recent studies have demonstrated the utility of alternate paths in improving connectivity of two end hosts. However studies that comprehensively evaluate the tradeoff between its effectiveness and overhead are lacking. In this paper we carefully characterize and evaluate the trade-off between (1) the efficacies of alternate path routing in improving end-to-end delay and loss, and (2) the overheads introduced by alternate routing methodology. This would help us to test the scalability of an overlay network. We collected ping data on PlanetLab and studied the above trade-off under different parameter settings such as path sampling frequency, overlayconnectivity, number of overlay hops etc. Results from ten sets of measurements using 35 to 36 of the PlanetLab nodes are used to test the effect of the various parameters. We find that changing epoch duration and connectivity helps reduce the overheads by a factor of 4 and 2 respectively at the cost of some lost performance gain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicast in DKS ( N , k , f ) Overlay Networks ? Luc

Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures for Internet scale applications. We are developing a family of infrastructures, DKS(N, k, f), for the construction of peer-to-peer applications. An instance of DKS(N, k, f) is an overlay network that implements a distrib...

متن کامل

Multicast in DKS(N, k, f) Overlay Networks

Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures for Internet scale applications. We are developing a family of infrastructures, DKS(N, k, f), for the construction of peer-to-peer applications. An instance of DKS(N, k, f) is an overlay network that implements a distrib...

متن کامل

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Distributed Event Routing in Publish/Subscribe Communication Systems: a Survey

Distributed event routing has emerged as a key technology for achieving scalable information dissemination. In particular it has been used as preferential communication backbone within publish/subscribe communication system. Its aim is to reduce the network and computational overhead per event diffusion to a set (possibly large) of interested recipients. This paper introduces an unifying framew...

متن کامل

A Topology Adaptation Protocol for Structured Superpeer Overlay Construction

Peer-to-peer networks can be divided into structured and unstructured based on their overlay topologies. In reality, unstructured p2p networks with superpeers have proved their capacities to support millions of users simultaneously. However, applications deployed on this kind of overlay networks, such as file-sharing, require flooding or gossip-based message routing, which puts more overhead on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004